Veri able Partial Escrow of Integer Factors

نویسنده

  • Wenbo Mao
چکیده

We construct an e cient interactive protocol for realizing veri able partial escrow of the factors of an integer n with time-delayed and threshold key recovery features. The computational cost of the new scheme amounts to 10k log2 P multiplications of numbers of size of P , where P is a protocol parameter which permits n of size up to (log2 P ) 4 to be dealt with and k is a security parameter which controls the error probability for correct key escrow under 1=2. The new scheme realizes a practical method for ne tuning the time complexity for factoring an integer, where the complexity tuning has no respect to the size of the integer.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verifiable Partial Escrow of Integer Factors Veriiable Partial Escrow of Integer Factors

We construct an e cient interactive protocol for realizing veri able partial escrow of the factors of an integer n with time-delayed and threshold key recovery features. The computational cost of the new scheme amounts to 10k log2 P multiplications of numbers of size of P , where P is a protocol parameter which permits n of size up to (log2 P ) 4 to be dealt with and k is a security parameter w...

متن کامل

Veri able Partial Sharing of Integer

It is not known to date how to partially share the factors of an integer (e.g., an RSA modulus) with veriiability. We construct such a scheme on exploitation of a signiicantly lowered complexity for factoring n = pq using a non-trivial factor of (n).

متن کامل

Verifiable Partial Escrow of Integer Factors

We construct an eecient interactive protocol for realizing veriiable partial es-crow of the factors of an integer n with time-delayed and threshold key recovery features. The computational cost of the new scheme amounts to 10k log 2 P multiplications of numbers of size of P , where P is a protocol parameter which permits n of size up to (log 2 P) ? 4 to be dealt with and k is a security paramet...

متن کامل

Publicly Veri able Secret Sharing

A secret sharing scheme allows to share a secret among several participants such that only certain groups of them can recover it. Veri able secret sharing has been proposed to achieve security against cheating participants. Its rst realization had the special property that everybody, not only the participants, can verify that the shares are correctly distributed. We will call such schemes publi...

متن کامل

Partial Key Escrow Monitoring Scheme

During (partial) key escrow, how to monitor a user safely and eeciently is a very important problem. This paper initially proposes a monitoring scheme of a typical partial key escrow scheme. In this scheme, the escrowed key of a user is not compromised even if the user has been monitored for many times.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000